Diversity Operators-based Artificial Fish Swarm Algorithm to Solve Flexible Job Shop Scheduling Problem
نویسندگان
چکیده
Artificial fish swarm algorithm (AFSA) is one of the critical intelligent algorithms. In this paper, authors decide to enhance AFSA via diversity operators (AFSA-DO). The will be producing more diverse solutions for obtain reasonable resolutions. AFSA-DO has been used solve flexible job shop scheduling problems (FJSSP). However, FJSSP a significant problem in domain optimization and operation research. Several research papers dealt with methods solving issue, including forms intelligence swarms. set target samples are tested employing improved confirm its effectiveness evaluate execution. Finally, paper concludes that enhanced discrepancies about initial AFSA, it also provided both sound quality resolution intersected rate.
منابع مشابه
Multiobjective Artificial Immune Algorithm for Flexible Job Shop Scheduling Problem
Flexible Job shop scheduling is very important in production management and combinatorial optimization. It is NP-hard problem and consists of two sub-problems: sequencing and assignment. Multiobjective Flexible Job-Shop Scheduling Problems (MFJSSP) is formulated as three-objective problem which minimizes completion time (makespan), critical machine workload and total work load of all machines. ...
متن کاملsolving flexible job-shop scheduling problem using hybrid algorithm based on gravitational search algorithm and particle swarm optimization
job shop scheduling problem has significant importance in many researchingfields such as production management and programming and also combinedoptimizing. job shop scheduling problem includes two sub-problems: machineassignment and sequence operation performing. in this paper combination ofparticle swarm optimization algorithm (pso) and gravitational search algorithm(gsa) have been presented f...
متن کاملHybrid Particle Swarm Optimization with Genetic Operators and Cauchy Distribution for Flexible Job-shop Scheduling Problem
Flexible job-shop scheduling problem (FJSP) has been well known as one of the most difficult NP-hard combinatorial optimization problems. This problem FJSP is an extension of job-shop scheduling problem (JSP) which is to create a sequence of operations satisfying the precedence relationship together with assignment of time and resources for each operation. Thus, the FJSP model is closer to the ...
متن کاملSingle Objective Evolutionary Algorithm for Flexible Job-shop Scheduling Problem
A meta-heuristic approach for solving the flexible job-shop scheduling problem (FJSP) is presented in this study. This problem consists of two sub-problems, the routing problem and the sequencing problem and is among the hardest combinatorial optimization problems. We propose a Evolutionary Algorithm (EA) for the FJSP. Our algorithm uses several different rules for generating the initial popula...
متن کاملGenetic algorithm for the flexible job-shop scheduling problem
In this paper, we propose a new optimization technique, the hierarchical multi-space competitive distributed genetic algorithm (HmcDGA), which is effective for the hierarchical optimization problem. It is an extension of the multi-space competitive distributed genetic algorithm (mcDGA), which was proposed by the authors. The mcDGA efficiently finds an optimal solution with a low computational c...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Baghdad Science Journal
سال: 2023
ISSN: ['2078-8665', '2411-7986']
DOI: https://doi.org/10.21123/bsj.2023.6810